Good concatenated code ensembles for the binary erasure channel
نویسندگان
چکیده
منابع مشابه
Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel
Analytic expressions for the exact probability of erasure for systematic, rate-1/2 convolutional codes used to communicate over the binary erasure channel and decoded using the soft-input, soft-output (SISO) and a posteriori probability (APP) algorithms are given. An alternative forward-backward algorithm which produces the same result as the SISO algorithm is also given. This low-complexity im...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملBounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
This paper provides simple lower bounds on the number of iterations which is required for successful message-passing decoding of some important families of graph-based code ensembles (including low-density parity-check codes and variations of repeat-accumulate codes). The transmission of the code ensembles is assumed to take place over a binary erasure channel, and the bounds refer to the asymp...
متن کاملScaling Law of Turbo Codes over the Binary Erasure Channel
Since turbo codes with iterative decoding were introduced [1], a huge amount of research activities have been conducted on the evaluation or prediction of the performance of turbo codes. The iterative turbo decoding algorithm can be analyzed by studying two open-loop constituent decoders separately [2]–[6]. Given the statistic of communication channel output, the behavior of each constituent de...
متن کاملAnalysis of Bipartite Graph Codes on the Binary Erasure Channel
We derive density evolution equations for codes on bipartite graphs (BG codes) for the binary erasure channel (BEC). We study the cases of local codes being introduced on only one side of the graph (Generalized LDPC codes) as well as on both sides. Each local code is assumed to correct up to a number of erasures one less than its distance. We define and enumerate stopping sets for BG codes, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2009
ISSN: 0733-8716
DOI: 10.1109/jsac.2009.090811